Edge erasures and chordal graphs
نویسندگان
چکیده
We prove several results about chordal graphs and weighted by focusing on exposed edges. These are edges that properly contained in a single maximal complete subgraph. This leads to characterization of via deletions sequence from graph. Most interesting is this context the connected components edge-induced subgraph 2 -edge connected. use latter fact case give modified version Kruskal's second algorithm for finding minimum spanning tree benefits being local an important sense.
منابع مشابه
Edge-Erasures and Chordal Graphs
We give a new characterization of chordal graphs via edge deletion from a complete graph, where edges eligible for deletion are each properly contained in a single maximal clique. Interestingly, in this context such edges always arise in cycles, and we use this fact to give a modified version of Kruskal’s second algorithm for finding a minimum spanning tree in a finite metric space.
متن کاملEdge clique graphs and some classes of chordal graphs
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe characterizations relative to edge clique graphs and some classes of chordal graphs, such as starlike, starlike-threshold, split and threshold graphs. In particular, a known necessary condition for a graph to be an edge c...
متن کاملEdge Contractions in Subclasses of Chordal Graphs
Modifying a given graph to obtain another graph is a wellstudied problem with applications in many fields. Given two input graphs G and H, the Contractibility problem is to decide whether H can be obtained from G by a sequence of edge contractions. This problem is known to be NP-complete already when both input graphs are trees of bounded diameter. We prove that Contractibility can be solved in...
متن کاملFrames, Graphs and Erasures
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...
متن کاملChordal Graphs
One can prove the following propositions: (1) For every non zero natural number n holds n − 1 is a natural number and 1 ≤ n. (2) For every odd natural number n holds n − 1 is a natural number and 1 ≤ n. (3) For all odd integers n, m such that n < m holds n ≤ m − 2. (4) For all odd integers n, m such that m < n holds m + 2 ≤ n. (5) For every odd natural number n such that 1 6= n there exists an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EJGTA : Electronic Journal of Graph Theory and Applications
سال: 2021
ISSN: ['2338-2287']
DOI: https://doi.org/10.5614/ejgta.2021.9.2.13